Sparse polynomial arithmetic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Arithmetic 3

(1) Many typos have been corrected (2) Some redoundancy has been eliminated Notes on polynomially bounded arithmetic Abstract We characterize the collapse of Buss' bounded arithmetic in terms of the prov-able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.

متن کامل

Plain Polynomial Arithmetic on GPU

As for serial code on CPUs, parallel code on GPUs for dense polynomial arithmetic relies on a combination of asymptotically fast and plain algorithms. Those are employed for data of large and small size, respectively. Parallelizing both types of algorithms is required in order to achieve peak performances. In this paper, we show that the plain dense polynomial multiplication can be efficiently ...

متن کامل

The multivariate arithmetic Tutte polynomial

We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two. We provide a generalized Fortuin-Kasteleyn representation for representable arithmetic matroids, with applications to arithmetic colorings and flows. We give a new proof of the positivity of the coefficients of the arithmetic Tutte polynomi...

متن کامل

Arithmetic of Unicritical Polynomial Maps

with derivative g b(w) = w n−1 , and use the conjugacy invariant b̂ = b . These normal forms (0.1) and (0.2) are related by the change of variable formula w = nz with b̂ = nĉ , and hence b = nc . (In particular, in the degree two case, b = b̂ is equal to 4c = 4ĉ .) If A is any ring contained in the complex numbers C , it will be convenient to use the non-standard notation A for the integral closur...

متن کامل

Random Sparse Polynomial Systems

Abstract Let f :=(f1, . . . , fn) be a sparse random polynomial system. This means that each f i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form. When U = (C∗)n, the classical mixed vol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGSAM Bulletin

سال: 1974

ISSN: 0163-5824

DOI: 10.1145/1086837.1086847